The microcomputer in linear algebra

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Algebra of Linear Algebra

3. You are already familiar with the concept of vector spaces in the form of …nite dimensional Euclidean vector spaces, and most of what we do in these lectures will involve these spaces (and, indeed, will also assume that the dot product operation is well-de…ned so that we can de…ne the matrix operations associated with linear transformations). However, it will also be useful to consider some ...

متن کامل

Linear Algebra . A publication of the International Linear Algebra Society

Nonnegative nilpotent lower triangular completions of a nonnegative nilpotent matrix are studied. It is shown that for every natural number between the index of the matrix and its order, there exists a completion that has this number as its index. A similar result is obtained for the rank. However, unlike the case of complex completions of complex matrices, it is proved that for every nonincrea...

متن کامل

Max-algebra: the linear algebra of combinatorics?

Let a ⊕ b = max(a, b), a ⊗ b = a + b for a, b ∈ R := R ∪ {−∞}. By max-algebra we understand the analogue of linear algebra developed for the pair of operations (⊕,⊗) extended to matrices and vectors. Max-algebra, which has been studied for more than 40 years, is an attractive way of describing a class of nonlinear problems appearing for instance in machinescheduling, information technology and ...

متن کامل

Linear Algebra in Physics

Looking at these five examples where linear algebra comes up in physics, we see that for the first three, involving “classical physics”, we have vectors placed at different points in space and time. On the other hand, the fifth example is a vector space where the vectors are not to be thought of as being simple arrows in the normal, classical space of everyday life. In any case, it is clear tha...

متن کامل

The Linear Algebra of UTP

We show that the well-known algebra of matrices over a semiring can be used to reason conveniently about predicates as used in the Unifying Theories of Programming (UTP). This allows a simplified treatment of the designs of Hoare and He and the prescriptions of Dunne. In addition we connect the matrix approach with the theory of test and condition semirings and the modal operators diamond and b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1987

ISSN: 0898-1221

DOI: 10.1016/0898-1221(87)90180-5